Methods for optimum and near optimum disassembly sequencing
نویسندگان
چکیده
منابع مشابه
Optimum Runge-Kutta Methods
The optimum Runge-Kutta method of a particular order is the one whose truncation error is a minimum. Various measures of the size of the truncation error are considered. The optimum method is practically independent of the measure being used. Moreover, among methods of the same order which one might consider using the difference in size of the estimated error is not more than a factor of 2 or 3...
متن کاملNear-optimum Synchronisers for Dpsk Modulation Schemes
Abstract: In this paper, simplified forms of Maximum A Posteriori ('MAP) synchronizers are developed for the DPSK scheme. It is shown these Circuits are simple enough to be realized only with digital ICs. such that, this conditional PDF is maximized which in turn minimizes estimation mor [l]. In Maximum Likelihood (ML) estimation, E is assumed to be an unknown constant in the range -Tf2 to +TJ2...
متن کاملNear optimum estimation of local fractal dimension for image segmentation
This paper presents an algorithm for estimating the local fractal dimension (LFD) of textured images. The algorithm is established by an experimental approach based on the blanket method. The proposed method uses the near optimum number of blankets to obtain the LFD for a small local window. The robustness of the proposed method to consistently estimate the LFD using up to a 3 3 local window is...
متن کاملEfficent Near-Optimum Detection Algorithms for MIMO Communication Systems
Wireless communications continue to strive for higher data rates and a better link reliability in order to provide more advanced services. The use of multiple antennas at both the transmitter and receiver side, i.e., multiple-input multiple-output (MIMO) communications, is one of the most promising technologies to satisfy these demands. Indeed, MIMO systems are capable of achieving increased da...
متن کاملNear-optimum Universal Graphs for Graphs with Bounded Degrees
Let H be a family of graphs. We say that G is H-universal if, for each H ∈ H, the graph G contains a subgraph isomorphic to H. Let H(k, n) denote the family of graphs on n vertices with maximum degree at most k. For each fixed k and each n sufficiently large, we explicitly construct an H(k, n)-universal graph Γ (k, n) with O(n(log n)) edges. This is optimal up to a small polylogarithmic factor,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2008
ISSN: 0020-7543,1366-588X
DOI: 10.1080/00207540601120484